Complexity of parametric initial value problems in Banach spaces
نویسندگان
چکیده
منابع مشابه
Complexity of parametric initial value problems in Banach spaces
We consider initial value problems for parameter dependent ordinary differential equations with values in a Banach space and study their complexity both in the deterministic and randomized setting, for input data from various smoothness classes. We develop multilevel algorithms, investigate the convergence of their deterministic and stochastic versions, and prove lower bounds.
متن کاملComplexity of parametric initial value problems for systems of ODEs
We study the approximate solution of initial value problems for parameter dependent finite or infinite systems of scalar ordinary differential equations (ODEs). Both the deterministic and the randomized setting is considered, with input data from various smoothness classes. We study deterministic and Monte Carlo multilevel algorithms and derive convergence rates. Moreover, we prove their optima...
متن کاملComplexity of Initial Value Problems
How complex could the solution be to an initial value problem given by a polynomial-time computable function? This question can be given a natural and precise sense in computational complexity theory. In this note, we put together several results stating that more conditions on the problem make the solution simpler. In particular, Lipschitz continuity alone may leave the solution polynomial-spa...
متن کاملMonotone Iterative Technique for the Initial Value Problems of Impulsive Evolution Equations in Ordered Banach Spaces
and Applied Analysis 3 The purpose of this paper is to improve and extend the above mentioned results. We will delete the Lipschitz condition 1.5 for impulsive function Ik and the restriction condition 1.6 and improve condition 1.4 for nonlinear term f . Our main results are as follows. Theorem 1.1. Let E be an ordered Banach space, whose positive cone P is normal, A : D A ⊂ E → E be a closed l...
متن کاملThe randomized complexity of initial value problems
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be γ-smooth (γ = r+% : the r-th derivatives satisfy a %-Hölder condition). Recently, the following almost sharp estimate of the order of the n-th minimal error was given by Kacewicz (Almost optimal solution of initial-value problems by rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2014
ISSN: 0885-064X
DOI: 10.1016/j.jco.2014.01.002